Contingency ranking with respect to overloads in very large power systems taking into account uncertainty, preventive and corrective actions

摘要

This paper deals with day-ahead security management with respect to a postulatedset of contingencies while taking into account uncertainties about the next daygeneration/load scenario. In order to help the system operator in decision makingunder uncertainty we aim at ranking these contingencies into four clusters accordingto the type of control actions needed to cover the worst uncertainty pattern ofeach contingency with respect to branch overload. To this end we use a fixed pointalgorithm that loops over two main modules: a discrete bi-level program (BLV) thatcomputes the worst-case scenario, and a special kind of security constrained optimalpower flow (SCOPF) which computes optimal preventive/corrective actions to cover theworst-case. We rely on a DC grid model, as the large number of binary variables, thelarge size of the problem, and the stringent computational requirements preclude theuse of existing mixed integer nonlinear programming (MINLP) solvers. Consequently wesolve the SCOPF using a mixed integer linear programming (MILP) solver while the BLVis decomposed into a series of MILPs. We provide numerical results with our approachon a very large European system model with 9241 buses and 5126 contingencies.